Geometry and Arithmetic of a Simple Cellular Automaton
نویسنده
چکیده
T his pap er pr esents t he results of a study of the geomet ric and arit hmetic prope rt ies of t he graph of a simple cellular automaton, considered as a mapping of t he uni t inter val to it self. T he graph provides an examp le of a st rict ly self-similar figur e and exhibits some numeric pr op ert ies relating to Fermat numbers. In ad dit ion an interest ing density resul t is proved: t he pred ecessor set of any number in [0, 1] is dense in the interval , and t he set of kt h-orde r pr edecessors of any number is uniformly dist ributed over a par tit ion of t he interval int o 2k uniform segments.
منابع مشابه
Novel Subtractor Design Based on Quantum-Dot Cellular Automata (QCA) Nanotechnology
Quantum-dot cellular automaton (QCA) is a novel nanotechnology with a very different computational method in compared with CMOS, whereas placement of electrons in cells indicates digital information. This nanotechnology with specifications such as fast speed, high parallel processing, small area, low power consumption and higher switching frequency becomes a promising candidate for CMOS tec...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملNew Directions In Cellular Automata
We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1 2 and operates on an arbitrary input size. The Automaton reads an Arithmetic Expression as an input and outputs another Arithmetic Expression. In Addition, we simulate a variety of One Dimensional Cellular Automata Structures with ...
متن کاملRobot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 5 شماره
صفحات -
تاریخ انتشار 1991